Caustic free completion of pressureless perfect fluid and k-essence
نویسندگان
چکیده
منابع مشابه
Dynamics of K-essence
There are a number of mathematical theorems in the literature on the dynamics of cosmological models with accelerated expansion driven by a positive cosmological constant Λ or a nonlinear scalar field with potential V (quintessence) which do not assume homogeneity and isotropy from the beginning. The aim of this paper is to generalize these results to the case of k-essence models which are defi...
متن کاملReconstructing K-essence
We present a model independent method of reconstructing the Lagrangian for the k-essence field driving the present acceleration of the universe. We consider the simplest k-essence model for which the potential is constant. Later we use three parametrizations for the Hubble parameter H(z), consistent with recent the SN1a data, to yield the Lagrangian F . Our reconstruction program does not gener...
متن کاملAtypical k-essence cosmologies
We analyze the implications of having a divergent speed of sound in k-essence cosmological models. We first study a known theory of that kind, for which the Lagrangian density depends linearly on the time derivative of the k-field. We show that consistency requires that the potential of the k-field be of the inverse square form. Then, we review the known result that the corresponding power-law ...
متن کاملIsotropic singularities in shear-free perfect fluid cosmologies
We investigate barotropic perfect fluid cosmologies which admit an isotropic singularity. From the General Vorticity Result of Scott, it is known that these cosmologies must be irrotational. In this paper we prove, using two different methods, that if we make the additional assumption that the perfect fluid is shear-free, then the fluid flow must be geodesic. This then implies that the only she...
متن کاملPerfect Completion and Deletion in Random Graphs
In the Perfect Completion problem one wishes to add the fewest possible edges to a graph in order to obtain a perfect graph. How large can the size of the added edge set be compared to the size of the edge set of the original graph? We show that with high probability the smallest perfect graph containing a random graph G(n; n 0:6) has (n 1:8) edges. We also show that with high probability the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2017
ISSN: 1029-8479
DOI: 10.1007/jhep08(2017)040